Equivariant con guration spaces
نویسندگان
چکیده
We use the compression theorem (cf [7; section 6]) to prove results for equivariant con guration spaces analogous to the well-known non-equivariant results of May, Milgram and Segal [5,6,8]. AMS Classi cation 55P91, 55P35, 55P40; 57R91, 55P45, 55P47
منابع مشابه
Finding Product Line Configurations with High Performance by Random Sampling
ABSTRACT Soware Product Lines (SPLs) have many features for customization. is raises the challenge to nd good performing congurations for an anticipated workload. As SPL conguration spaces are huge, it is infeasible to benchmark all congurations to nd an optimal one. Prior work focused on building performance models to predict and optimize SPL congurations; we randomly sample and recurs...
متن کاملSliced Con guration Spaces for Curved Planar Bodies
We present the rst practical, implemented con guration space computation algorithm for a curved planar object translating and rotating amidst stationary obstacles. The bodies are rigid, compact, regular, and bounded by a nite number of rational parametric curve segments. The algorithm represents the three-dimensional con guration space as two-dimensional slices in which the moving object has a ...
متن کاملCon guration Flatness of Lagrangian Systems Underactuated by One Control
Lagrangian control systems that are di erentially at with at outputs that only depend on con guration variables are said to be con guration at We provide a complete characterisation of con guration atness for systems with n degrees of freedom and n controls whose range of con trol forces only depends on con guration and whose Lagrangian has the form of kinetic energy minus potential The method ...
متن کاملRafiki: A Middleware for Parameter Tuning of NoSQL Datastores for Dynamic Metagenomics Workloads
High performance computing (HPC) applications, such as metagenomics and other big data systems, need to store and analyze huge volumes of semi-structured data. Such applications oen rely on NoSQL-based datastores, and optimizing these databases is a challenging endeavor, with over 50 conguration parameters in Cassandra alone. As the application executes, database workloads can change rapidly ...
متن کاملIntegration of Distributed Constraint-Based Con gurators
Con guration problems are a thriving application area for declarative knowledge representation that experiences a constant increase in size and complexity of knowledge bases. However, today's con gurators are designed for solving local con guration problems not providing any distributed con guration problem solving functionality. Consequently the challenges for the construction of con guration ...
متن کامل